Encoding Generic Judgments
نویسندگان
چکیده
The operational semantics of a computation system is often presented as inference rules or, equivalently, as logical theories. Specifications can be made more declarative and high-level if syntactic details concerning bound variables and substitutions are encoded directly into the logic using term-level abstractions (λ-abstraction) and proof-level abstractions (eigenvariables). When one wishes to reason about relations defined using term-level abstractions, generic judgment are generally required. Care must be taken, however, so that generic judgments are not uniformly handled using proof-level abstractions. Instead, we present a technique for encoding generic judgments and show two examples where generic judgments need to be treated at the term level: one example is an interpreter for Horn clauses extended with universal quantified bodies and the other example is that of the π-calculus.
منابع مشابه
A Proof Theory for Generic Judgments: An extended abstract
A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of the sequent) and to each formula in the sequent (used to account for generic variables locally scoped over the form...
متن کاملConceptually driven encoding episodes create perceptual misattributions.
Processing fluency caused by prior encoding of a word is shown to increased duration judgments about that word and to decrease brightness contrast judgments about its mask when the word is presented in a masked word identification task. These effects occurred following an encoding task that involved visual perception of the words (reading aloud) and a task that provided no direct visual experie...
متن کاملAn Extension of L λ Unification ?
An extension of the language Lλ is given. The extension was mainly motivated by applications of higher-order abstract syntax in encoding generic judgments, where object-level signatures need to be coded explicitly. It is shown that this extension preserves the m.g.u property and the decidability of the unification problems.
متن کاملA Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆∇ of Miller and Tiu, with an induction principle. The logic FOλ∆∇ is itself an extension of intuitionistic logic with fixed points and a “generic quantifier”, ∇, which is used to reason about the dynamics of bindings in object systems encoded in the logic. A previous attempt to extend FOλ∆∇ with an ...
متن کاملCut Elimination for a Logic with Generic Judgments and Induction
This paper presents a cut-elimination proof for the logic LG, which is an extension of a proof system for encoding generic judgments, the logic FOλ of Miller and Tiu, with an induction principle. The logic LG, just as FOλ, features extensions of first-order intuitionistic logic with fixed points and a “generic quantifier”, ∇, which is used to reason about the dynamics of bindings in object syst...
متن کامل